/*
 * Copyright (c) 2008, Yifu Huang
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *     * Redistributions of source code must retain the above copyright
 *       notice, this list of conditions and the following disclaimer.
 *     * Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in the
 *       documentation and/or other materials provided with the distribution.
 *     * Neither the name of SleekIce nor the
 *       names of its contributors may be used to endorse or promote products
 *       derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ``AS IS'' AND ANY
 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL <copyright holder> BE LIABLE FOR ANY
 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

package com.sleekice.util;

/* node in a dynamic linked list */
public class ListNode<E>
	{
	// refers to the object in this node
	private E value = null;
	// refers to the next node
	private ListNode<E> next = null;
	// refers to the previous node
	private ListNode<E> previous = null;

	// Constructor
	public ListNode(E value, ListNode<E> next, ListNode<E> previous)
		{
		this.value = value;
		this.next = next;
		this.previous = previous;
		}

	// return the next list node after this one
	public ListNode<E> next()
		{
		return next;
		}

	// return the previous list node before this one
	public ListNode<E> previous()
		{
		return previous;
		}

	// sets the next object after this object
	public void setNext(ListNode<E> next)
		{
		this.next = next;
		}

	// sets the previous object before this object
	public void setPrevious(ListNode<E> previous)
		{
		this.previous = previous;
		}
	
	/* set the object node is holding */
	public void setValue(E object) {
		value = object;
	}

	// returns the object in this node
	public E getValue()
		{
		return value;
		}
	}
